Alternating paths through disjoint line segments
نویسندگان
چکیده
منابع مشابه
Alternating paths through disjoint line segments
We show that every segment endpoint visibility graph on disjoint line segments in the plane admits an alternating path of length , answering a question of Bose. This bound is optimal apart from a constant factor. We also give bounds on the constants hidden by the asymptotic notation.
متن کاملAlternating Paths along Orthogonal Segments
It was shown recently that in the segment endpoint visibility graph Vis(S) of any set S of n disjoint line segments in the plane, there is an alternating path of length (log n), and this bound best possible apart from a constant factor. This talk focuses on the variant of the problem where S is a set of n disjoint axis-parallel line segments, and shows that the length of a longest alternating p...
متن کاملAlternating Paths along Axis-Parallel Segments
It is shown that for a set S of n pairwise disjoint axis-parallel line segments in the plane there is a simple alternating path of length Ω( √ n). This bound is best possible in the worst case. In the special case that the n pairwise disjoint axis-parallel line segments are protruded (that is, if the intersection point of the lines through every two nonparallel segments is not visible from both...
متن کاملOn Spanning Disjoint Paths in Line Graphs
Spanning connectivity of graphs has been intensively investigated in the study of interconnection networks (Hsu and Lin, Graph Theory and Interconnection Networks, 2009). For a graph G and an integer s > 0 and for u, v ∈ V (G)with u = v, an (s; u, v)-path-system of G is a subgraph H consisting of s internally disjoint (u, v)paths. A graph G is spanning s-connected if for any u, v ∈ V (G) with u...
متن کاملEvery Set of Disjoint Line Segments Admits a Binary
Given a set of n disjoint line segments in the plane, we show that it is always possible to form a tree with the endpoints of the segments such that each line segment is an edge of the tree, the tree has no crossing edges, and the maximum vertex degree of the tree is 3. Furthermore, there exist conngurations of line segments where any such tree requires degree 3. We provide an O(n log n) time a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2003
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(03)00349-1